b-tree indexing中文什么意思

例句与用法

1. Hbt lock on a heap or b - tree index
   Hbt =堆或b树索引的锁。
2. Nonclustered indexes have a b - tree index structure similar to the one in clustered indexes
   非聚集索引与聚集索引有一个相似的b树索引结构。
3. All internal data structures , such as b - tree indexes or doubly - linked lists , must be correct at the end of the transaction
   事务结束时，所有的内部数据结构（如b树索引或双向链表）都必须是正确的。
4. The clustered index is implemented as a b - tree index structure that supports fast retrieval of the rows , based on their clustered index key values
   聚集索引按b树索引结构实现， b树索引结构支持基于聚集索引键值对行进行快速检索。
5. These algorithms lead to optimal join performance : nodes that do not participate in the join can be judged beforehand and then skipped using b - tree index . besides , each element list joined is scanned sequentially once at most . furthermore , output of join results is sorted in document order
   其次，提出了两个高效的兄弟关系的结构连接算法，这两个算法具有较好的连接性能：不参与连接的结点可以事先判断出来并利用b树跳过，连接的两个列表最多都只需扫描一次，而且连结结果按照文档序有序。